QMA with Subset State Witnesses

نویسندگان

  • Alex Bredariol Grilo
  • Iordanis Kerenidis
  • Jamie Sikora
چکیده

The class QMA plays a fundamental role in quantum complexity theory and it has found surprising connections to condensed matter physics and in particular in the study of the minimum energy of quantum systems. In this paper, we further investigate the class QMA and its related class QCMA by asking what makes quantum witnesses potentially more powerful than classical ones. We provide a definition of a new class, SQMA, where we restrict the possible quantum witnesses to the ”simpler” subset states, i.e. a uniform superposition over the elements of a subset of n-bit strings. Surprisingly, we prove that this class is equal to QMA, hence providing a new characterisation of the class QMA. We also prove the analogous result for QMA(2) and describe a new complete problem for QMA and a stronger lower bound for the class QMA1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast amplification of QMA

Given a verifier circuit for a problem in QMA, we show how to exponentially amplify the gap between its acceptance probabilities in the ‘yes’ and ‘no’ cases, with a method that is quadratically faster than the procedure given by Marriott and Watrous [1]. Our construction is natively quantum, based on the analogy of a product of two reflections and a quantum walk. Second, in some special cases w...

متن کامل

The local Hamiltonian problem on a line with eight states is QMA-complete

The Local Hamiltonian problem – estimating the ground state energy of a local Hamiltonian – is a natural problem in physics, and belongs to the complexity class QMA. QMA is the quantum analogue of NP. Languages in QMA have a quantum verifier: a polynomial-time quantum algorithm that takes (poly-sized) quantum states as witnesses. In quantum mechanics, the Hamiltonian of a system is the Hermitia...

متن کامل

Quantum vs Classical Proofs and Subset Verification

We study the ability of efficient quantum verifiers to decide properties of exponentially large subsets given either a classical or quantum witness. We develop a general framework that can be used to prove that QCMA machines, with only classical witnesses, cannot verify certain properties of subsets given implicitly via an oracle. We use this framework to prove an oracle separation between QCMA...

متن کامل

On the Power of a Unique Quantum Witness

In a celebrated paper, Valiant and Vazirani [29] raised the question of whether the difficulty of NP-complete problems was due to the wide variation of the number of witnesses of their instances. They gave a strong negative answer by showing that distinguishing between instances having zero or one witnesses is as hard as recognizing NP, under randomized reductions. We consider the same question...

متن کامل

ua nt - p h / 06 04 16 6 v 1 2 1 A pr 2 00 6 Consistency of Local Density Matrices is QMA - complete

Suppose we have an n-qubit system, and we are given a collection of local density matrices ρ 1 ,. .. , ρ m , where each ρ i describes a subset C i of the qubits. We say that the ρ i are " consistent " if there exists some global state σ (on all n qubits) that matches each of the ρ i on the subsets C i. This generalizes the classical notion of the consistency of marginal probability distribution...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015